Upper bound on the number of ternary square-free words
نویسندگان
چکیده
Let tn be the number of words of length n in a factorial language L. We adapt the transfert matrix method to obtain upper bounds on the growth rate of words in L defined as limn→∞ (tn) 1 n . This method is used to lower the best known upper bounds on the growth rate of ternary square-free words from 1.30193812.. to 1.30178858..
منابع مشابه
Improved bounds on the number of ternary square-free words
Improved upper and lower bounds on the number of squarefree ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples can essentially be reduced to a combinatorial problem, which can efficiently be treated by computer. In part...
متن کاملn-Letter Ternary Square-Free Words
Recently, Ekhad and Zeilberger [4] presented an improved lower bound for the “connective constant” of ternary square-free words. Their bound of 2 is proven by constructing a “Brinkhuis triple-pair” of length 18. By presenting a Brinkhuis triple-pair of length 17, we show that, within the same particular class of Brinkhuis triples, the optimal bound is actually 2. A square-free word w is a word ...
متن کاملThe minimal density of a letter in an infinite ternary square - free word is 0 . 2746
We study the minimal density of letters in infinite square-free words. First, we give some definitions of minimal density in infinite words and prove their equivalence. Further, we propose a method that allows to strongly reduce an exhaustive search for obtaining lower bounds for minimal density. Next, we develop a technique for constructing square-free morphisms with extremely small density fo...
متن کاملNew Lower-bound on the Number of Ternary Square-free Words
A new lower bound on the number of n-letter ternary square-free words is presented: 110, which improves the previous best result of 65.
متن کاملOn the Entropy and Letter Frequencies of Ternary Square-Free Words
We enumerate all ternary length-` square-free words, which are words avoiding squares of words up to length `, for ` ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensemble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008